IT University of Copenhagen - PDFSEARCH.IO - Document Search Engine

IT University of Copenhagen
Results: 194

#	Item
81	Linear Contextual Modal Type Theory Anders Schack-Nielsen IT University of Copenhagen Copenhagen, Denmark Add to Reading List Source URL: www.itu.dk - Date: 2009-01-27 05:07:00
82	Typed polyadic pi-calculus in bigraphs ∗ Mikkel Bundgaard Vladimiro Sassone IT University of Copenhagen Add to Reading List Source URL: www.itu.dk - Date: 2009-02-19 09:48:17
83	A CPS Encoding of Name-Passing in Higher-Order Mobile Embedded Resources Mikkel Bundgaard ∗ Thomas Hildebrandt Jens Chr. Godskesen Department of Theoretical Computer Science IT University of Copenhagen Copenhagen, Denm Add to Reading List Source URL: www.itu.dk - Date: 2009-02-19 09:48:17
84	Faster Join-Projects and Sparse Matrix Multiplications Rasmus Resen Amossen Rasmus Pagh IT University of Copenhagen Add to Reading List Source URL: rasmus.resen.org - Date: 2009-05-12 14:06:13
85	Monte Carlo Tree Search for Simulated Car Racing Jacob Fischer1 , Nikolaj Falsted1 , Mathias Vielwerth1 , Julian Togelius2 , and Sebastian Risi1 1 Center for Computer Games Research, IT University of Copenhagen, Denmark Add to Reading List Source URL: julian.togelius.com - Date: 2015-05-10 03:56:24
86	Nordic Journal of Computing Axiomatizing Binding Bigraphs T.C. Damgaard IT University of Copenhagen Denmark Add to Reading List Source URL: www.itu.dk - Date: 2006-11-23 10:05:22
87	A New Data Layout For Set Intersection on GPUs Rasmus Resen Amossen and Rasmus Pagh IT University of Copenhagen, Denmark Email: {resen,pagh}@itu.dk Abstract—Set intersection is the core in a variety of problems, e.g. Add to Reading List Source URL: rasmus.resen.org - Date: 2011-02-09 19:13:29
88	Proof-Directed Programming Twelf - A Case Study Carsten Sch¨ urmann IT University of Copenhagen joint work with Frank Pfenning Add to Reading List Source URL: www.itu.dk - Date: 2006-12-19 08:05:41
89	Cuckoo Hashing for Undergraduates Rasmus Pagh IT University of Copenhagen March 27, 2006 Abstract This lecture note presents and analyses two simple hashing algorithms: Add to Reading List Source URL: www.itu.dk - Date: 2006-03-27 02:59:26
90	Algorithms and Data Structures, Reexam March 2011 IT University of Copenhagen Instructions You will draw two sheets with questions — one of type A and one of type B. Use the preparation time to prepare yourself to disc Add to Reading List Source URL: itu.dk - Date: 2011-11-09 08:00:40

UPDATE